Parallel prefix computation with few processors
نویسندگان
چکیده
منابع مشابه
Computation-Efficient Parallel Prefix
We are interested in solving the prefix problem of n inputs using p < n processors on completely connected distributed-memory multicomputers (CCDMMs). This paper improves a previous work in three respects. First, the communication time of the previous algorithm is reduced significantly. Second, we show that p(p + 1)/2 < n is required for the new algorithm and the original one to be applicable. ...
متن کاملProbabilistic Parallel Prefix Computation
Given inputs ~1,. . . , z,,, which are independent identically distributed random variables over a domain D, and an associative operation o, the probabilistic prej?x computation problem is to compute the product ~1 o x2 o . . . o xn and its n 1 prefixes. Instances of this problem are finite state transductions on random inputs, the addition or subtraction of two random n-bit binary numbers, and...
متن کاملNon-Associative Parallel Prefix Computation
Chen, R.-J. and Y.-S. Hou, Non-associative parallel prefix computation, Information Processing Letters 44 (1992) 91-94. Associativity of a binary operation allows many applications that are not possible with a non-associative binary operation. We propose a method to transform a binary expression into an associative one and present two related applications.
متن کاملOn-Line Adaptive Parallel Prefix Computation
We consider parallel prefix computation on processors of different and possibly changing speeds. Extending previous works on identical processors, we provide a lower bound for this problem. We introduce a new adaptive algorithm which is based on the on-line recursive coupling of an optimal sequential algorithm and a parallel one, non-optimal but recursive and fine-grain. The coupling relies on ...
متن کاملApplication-specific array processors for binary prefix sum computation
The main contribution of this work is to propose two application-specific bus architectures for computing the p r e f i sums of a binary sequence. Our architectures feature the following characteristics: (1) all broadcasts occur on buses of length I5 or 63; ( 2 ) we use a new technique t h a ~ we call shift switching which allows switches to cyclically permute an incoming signul, dramatically i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1992
ISSN: 0898-1221
DOI: 10.1016/0898-1221(92)90009-7